package com.work.leetcode.solution;

/**
 * Created by suk on 2020/4/13.
 */
public class BinaryTreeTraversal {

    /*
     * 二叉树的重构，先序、中序、后序
     */
    public void t1() {

    }
    public static void main(String[] args) {

    }
}
